package LeetCode;

public class LC85 {
    public int maximalRectangle(char[][] matrix) {
        int row = matrix.length ;
        int column = matrix[0].length;
        int[][] ints = new int[row][column];
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                if(matrix[i][j] == '1'){
                    ints[i][j] = i==0 ? 1: ints[i][j-1]+1;
                }
            }
        }
        return 0;

    }
}
